Solving one-dimensional unconstrained global optimization problem using parameter free filled function method
نویسندگان
چکیده
منابع مشابه
A filled function method with one parameter for unconstrained global optimization
For Rn constrained global optimization problem, a new auxiliary function with one parameter is proposed for escaping the current local minimizer. First, a new definition of filled function is given and under mild assumptions, it is proved to be a filled function. Then a new algorithm is designed according to the theoretical analysis and some preliminary numerical results are given to demonstrat...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملSolving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
Infinite horizon optimization (IHO) problems present a number of challenges for their solution, most notably, the inclusion of an infinite data set. This hurdle is often circumvented by approximating its solution by solving increasingly longer finite horizon truncations of the original infinite horizon problem. In this paper, we adopt a novel transformation that reduces the infinite dimensional...
متن کاملUsing Complex Method Guidance GSO Swarm Algorithm for Solving High Dimensional Function Optimization Problem
In order to overcome the basic glowworm swarm optimization (GSO) algorithm in the high dimension space function optimization effect is poor defects. This paper, we introduce the idea of the traditional complex method, with the complex method the worst part of the glowworm guidance for reflection be good glowworm swarm, so as to continuously make the worst glowworm swarm become the better glowwo...
متن کاملA Novel Filled Function Method for Global Optimization
This paper considers the unconstrained global optimization with the revised filled function methods. The minimization sequence could leave from a local minimizer to a better minimizer of the objective function through minimizing an auxiliary function constructed at the local minimizer. Some promising numerical results are also included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2019
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v17i5.10885